#include <iostream>
#include <algorithm>
using namespace std;

#include "PriorityQueue.h"

int main()
{
	ouyang::Priority_Queue<int, vector<int>, Greater<int>> heap;
	heap.push(4);
	heap.push(5);
	heap.push(6);
	heap.push(7);
	heap.push(9);
	while (!heap.empty())
	{
		cout << heap.top() << " ";
		heap.pop();
	}

	return 0;
}